Bound for 2-exponents of Primitive Extremal Ministrong Digraphs
نویسندگان
چکیده
We consider 2-colored digraphs of the primitive ministrong digraphs having given exponents. In this paper we give bounds for 2-exponents of primitive extremal ministrong digraphs.
منابع مشابه
Upper Generalized Exponents of Ministrong Digraphs
We obtain upper bounds for the upper generalized exponents of digraphs in the class of ministrong digraphs and in the class of non-primitive ministrong digraphs, characterize the corresponding extremal digraphs, and discuss the numbers attainable as upper generalized exponents of ministrong digraphs.
متن کاملWell primitive digraphs
A primitive digraph D is said to be well primitive if the local exponents of D are all equal. In this paper we consider well primitive digraphs of two special types: digraphs that contain loops, and symmetric digraphs with shortest odd cycle of length r. We show that the upper bound of the exponent of the well primitive digraph is n− 1 in both these classes of digraphs, and we characterize the ...
متن کاملExponents of 2-regular digraphs
A digraph G is called primitive if for some positive integer k, there is a walk of length exactly k from each vertex u to each vertex v (possibly u again). If G is primitive, the smallest such k is called the exponent of G, denoted by exp(G). A digraph G is said to be r-regular if each vertex in G has outdegree and indegree exactly r. It is proved that if G is a primitive 2-regular digraph with...
متن کاملGeneralized Exponents of Primitive Symmetric Digraphs
A strongly connected digraph D of order n is primitive (aperiodic) provided the greatest common divisor of its directed cycle lengths equals 1. For such a digraph there is a minimum integer t, called the exponent of D, such that given any ordered pair of vertices x and y there is a directed walk from x to y of length t. The exponent of D is the largest of n ‘generalized exponents’ that may be a...
متن کاملGeneralized exponents of non-primitive graphs
The exponent of a primitive digraph is the smallest integer k such that for each ordered pair of (not necessarily distinct) vertices x and y there is a walk of length k from x to y. As a generalization of exponent, Brualdi and Liu (Linear Algebra Appl. 14 (1990) 483499) introduced three types of generalized exponents for primitive digraphs in 1990. In this Paper we extend their definitions of g...
متن کامل